Fast identification of complex strings in a data stream

ABSTRACT

A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

RELATED APPLICATIONS

The present application is a Continuation of U.S. patent applicationSer. No. 13/862,849 filed on Apr. 15, 2013;

which in turn is a Continuation of U.S. patent application Ser. No.13/371,455 filed on Feb. 12, 2012, which has issued as a U.S. Pat. No.8,423,572 on Apr. 16, 2013;

which in turn is a Continuation of application Ser. No. 13/270,632 filedon Oct. 11, 2011, which has issued as a U.S. Pat. No. 8,117,229 on Feb.14, 2012;

which in turn is a Continuation of application Ser. No. 13/155,212 filedon Jun. 7, 2011, which has issued as a U.S. Pat. No. 8,069,183 on Nov.29, 2011;

which in turn is a Continuation of U.S. patent application Ser. No.13/011,395 filed on Jan. 21, 2011, which has issued as a U.S. Pat. No.7,987,196 on Jul. 26, 2011;

which in turn is a Continuation of U.S. patent application Ser. No.12/605,357 filed on Oct. 25, 2009, which has issued as a U.S. Pat. No.7,899,842 on Mar. 1, 2011;

which in turn is a Divisional from the parent U.S. application Ser. No.11/678,587 filed on Feb. 24, 2007 to Boyce entitled “Fast identificationof Complex Strings in a Data Stream”, which has issued as a U.S. Pat.No. 7,630,982 on Dec. 8, 2009;

the entire contents of the above noted applications and issued patentsbeing incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to detection of complex strings in a datastream.

BACKGROUND

Fast search techniques are needed in many computing and networkapplications such as search engines and network addressing. Regularsearch of a string in a dictionary of strings of fixed sizes is rathersimple, using for example binary search. With a dictionary ofvariable-size strings, the matching process becomes more intricate. Astring of arbitrary size in which each character is uniquely defined inan alphabet is colloquially called an “exact string”. A string ofarbitrary size in which at least one character may be replaced withoutchanging the purpose of the string is colloquially called an “inexactstring”. The search for an inexact string is complicated. For examplesearching for a name such as “John Winston Armstrong” in a dictionary ofnames is much simpler than searching for any name in the dictionary thatcontains a string such as “J . . . ton.Arm”, where ‘.’ may represent anyof a subset of characters in the alphabet. In the latter, each of alarge number of strings such as “Jane Clinton-Armbruster” and “JackNewton Armstrong” is considered a successful match.

Numerous software-based techniques, suitable for implementation in ageneral-purpose computer, for fast matching of exact strings in whicheach character is uniquely defined and corresponds to a pre-definedalphabet are known. The Aho-Corasick algorithm, for example, is known tobe computationally efficient and may be used in real-time applications,see, e.g., a paper by Alfred V. Aho and Margaret J. Corasick “EfficientString Matching: An Aid to Bibliographic Search” published in theCommunications of the ACM, Jun. 1975, Volume 18, Number 06, p. 333-340.Software-based techniques for matching “inexact strings” are also known,but are too slow for certain real-time applications such as networksecurity applications which require fast execution, see, e.g., a paperby Ricardo A. Baeza-Yates and Gaston H. Connet “A New Approach to TextSearching” published in Communications of the ACM, 35, October 1992, p.74-82.

Regular Expressions, as described, for example, in the paper written byKen Thompson “Regular Expression Search Algorithm” published inCommunications of the ACM, Vol. 11, Number 6, Jun. 1968, p. 419-422 arecommonly used for representing inexact strings. Regular expressions canbe implemented efficiently using special-purpose hardware. Howevermethods for efficient implementation of regular expressions in ageneral-purpose computer are yet to be developed. Softwareimplementations of regular expressions either require a memory ofextremely large size or execute in a non-bounded time which is afunction of the number of such inexact strings to be considered, thecomplexity of the individual inexact strings, and input data to beexamined.

One solution adopted in prior art is to use a two-stage algorithm wherean algorithm for simple search, such as the Aho-Corasick algorithm, isused to efficiently find parts of packet data, which contain some partof the patterns of interest, and then a slower regular-expression-basedalgorithm is applied to a potentially lesser number of patterns todetect inexact patterns. Such a solution can handle a large variety ofinexact patterns but has significant drawbacks including: (a)unpredictable computation effort to determine the existence, orotherwise, of a matching inexact string, the processing time being afunction both of the data content and of the size and complexity of thepatterns; (b) incomplete pattern identification where only a part of apattern may be found without readily defining the boundaries of thepattern in an examined data stream—verifying a match with regularexpressions may require access to a large amount of preceding data up tothe possible start point, and may require waiting for data that has notyet been received; c) a requirement for post-processing to detectpatterns in order of occurrence as neither the start nor end points maybe known in advance, forcing ensemble matching and sorting.

Network intrusion detection and prevention is concerned with protectingcomputer systems from unintended or undesired network communications. Afundamental problem is in determining if packets in a data streamcontain data strings of specific patterns (also called signatures) whichare known to exploit software vulnerabilities in the computer systems.The number of such signatures of practical concern is very large andtheir structure is rapidly changing. Many of these signatures cannotpractically be expressed as ordinary sequences of characters. Forexample a credit-card number uniquely identifies a specific credit cardwhile a string comprising common digits of the numbers of all creditcards issued by one bank does not uniquely identify a specific creditcard.

A string inserted in a data stream may be harmful to a recipient of thedata stream and, hence, the need to locate the string to enable furthercorrective actions. Clearly, any means for detecting strings of specialinterest in a continuous data stream has to be sufficiently fast. Oneapproach for fast detection is to devise special-purpose hardwarecircuitry with concurrent processing. However, considering the fast paceof network changes, a solution based on special-purpose hardware may beimpractical.

A software solution is highly desirable because of its low cost, ease ofdeployment, and ease of adapting to the changing communicationsenvironment. There is therefore a need for a software-based algorithmthat can detect a large set of strings under execution-time constraintsand memory limitations in order to enhance Intrusion prevention systems(IPS) and intrusion detection systems (IDS).

SUMMARY

In accordance with one aspect, the present invention provides a methodof examining a data stream to detect presence of at least one complexstring belonging to a predefined complex dictionary. The methodcomprises steps of: associating an array of state variables and an arrayof reference states with the complex dictionary with one-to-onecorrespondence between entries of the complex dictionary, the array ofstate variables, and the array of reference states; detecting a simplestring in the data stream, the simple string being a constituent simplestring in each of at least one complex string in the complex dictionary;updating a state variable associated with the each of at least onecomplex string according to all relative positions of the simple stringwithin the each of at least one complex string; and determining that theeach of at least one complex string is present in the data stream whenthe state variable attains a corresponding reference state.

In one realization of the method, a multi-bit Boolean state variable isused. Consequently, the step of updating the state variable comprisessteps of: (1) shifting bits of the Boolean state variable a number ofpositions determined according to a position of the simple string in thedata stream and a previous position of any simple string detected in thedata stream and belonging to the each of at least one complex string;(2) setting an end bit of the Boolean state to indicate logical TRUE;and (3) performing a logical AND of the state variable and a bitmaskassociated with the simple string, the bitmask indicating the allrelative positions of the simple string within the each of at least onecomplex string.

The bitmask may originate at the rightmost bit and, consequently, theBoolean state variable is shifted in the direction from right to leftwith the rightmost bit of the Boolean variable set to equal TRUE.Alternatively, the bitmask may originate at the leftmost bit and,consequently, the Boolean state variable may be shifted in the directionfrom left to right with the leftmost bit of the Boolean variable set toequal TRUE.

The corresponding reference state indicates a specific relative positionof a last character of a last simple string in each of the at least onecomplex string. In an exemplary realization, the corresponding referencestate is a multi-bit Boolean constant having a bit corresponding to thespecific relative position set to logical TRUE, and the presence of eachof the at least one complex string in the data stream is determined byperforming a logical AND of the state variable and the correspondingreference state, with the outcome overwriting a current value of thestate variable. The bit in the state variable at a positioncorresponding to the specific relative position is then examined and ifits state is TRUE, detection of a respective complex string may beascertained subject to congruence of a suffix of the respective complexstring to a corresponding portion of the data stream.

In accordance with another aspect, the present invention provides amethod of detecting the presence of a selected complex string from apredefined complex dictionary in a data stream. The selected complexstring comprises a predefined number χ>1 of simple strings with eachsimple string having a prefix of indefinite characters. The last simplestring of the complex string has a suffix of indefinite characters,which is considered a suffix of the complex string. The prefix of thefirst simple string may be a NULL string, and the suffix may be a NULLstring. A NULL string is an empty string with zero characters. Themethod comprises steps of: locating a first portion of the data streamwhere the first portion is identical to a first simple string of theselected complex string; ascertaining congruence of an adjacent portionof the data stream, preceding the first portion, to a prefix of thefirst simple string; locating a second portion of the data stream wherethe second portion is identical to a second simple string of theselected complex string; and ascertaining congruence of an interveningportion between the first portion and the second portion to a prefix ofthe second simple string. Notably, congruence of a NULL string to anyother NULL string is, by definition, ascertained.

The method includes a further step of ascertaining congruence of thesuffix to a corresponding portion of the data stream determinedaccording to a length of the complex string. Where the number of simplestrings in a complex string exceeds 2, i.e., χ>2, the method comprisesfurther steps of locating an m^(th) portion of the data stream is them^(th) portion being identical to an m^(th) simple string of theselected complex string; and ascertaining congruence of an interveningportion, of the data stream, preceding the m^(th) portion and a prefixof an m^(th) simple string, the intervening portion following an(m−1)^(th) portion of the data stream found to be identical to an(m−1)^(th) simple string in the selected complex string.

In accordance with another aspect, the present invention provides amethod of identifying a complex string in a data stream, the methodcomprising steps of: segmenting the complex string into a suffix and aset of string segments, each string segment comprising a prefix and asimple string, where the prefix comprises indefinite characters and thesuffix comprises indefinite characters; generating an array of bitmaskseach bitmask associated with a string segment in the set of stringsegments, the bitmask indicating a location index of an end character ofthe each string segment; associating a Boolean state variable with thecomplex string; locating a current simple-matching position in the datastream at which at least one simple-string belonging to the complexstring terminates; initializing a current mask as an opaque mask;performing a logical OR operation of the current mask with selectedbitmasks corresponding to the at least one simple string to produce acomposite current mask; determining a gap between the currentsimple-matching position and a previous simple-matching position;left-shifting each entry of the state variable by the gap, replacingeach shifted entry by “0” and setting the rightmost entry to “1”; andupdating the state variable according to a logical AND operation withthe composite current mask.

The method comprises a step of determining that a portion of the datastream terminating at the current simple-matching position contains thecomplex string when a bit in a target position of the state variablerepresents a logical TRUE, where the target position corresponds to alast location index of an end character of a last string segment withinthe complex string.

The method comprises a further step of associating a segment descriptorwith each string segment. The segment descriptor indicates a length ofthe string segment and a length of a prefix of the string segment. Alast string segment within the complex string further comprisesindications of a length of the suffix and a target positioncorresponding to a last location index of an end character of a laststring segment within the complex string. Each selected bitmaskassociated with a specific simple string satisfies a condition ofcongruence of a prefix of the specific simple string and a correspondingportion of the data stream. When the suffix includes at least onecharacter, the method comprises a step of determining that a portion ofthe data stream terminating at a position of index equal to an index ofthe current simple-matching position plus a length of the suffix whenthe state variable contains a logical TRUE at the target position andthe suffix is congruent with a portion of the data stream succeeding thecurrent simple-matching position.

In accordance with a further aspect, the present invention provides amethod of screening a data stream to detect presence of any complexstring from a predefined complex dictionary. The method comprises apreprocessing step of transforming the complex dictionary into asegmented dictionary, an array of segment descriptors, and an array ofbitmasks. The segmented dictionary comprises string segments of eachcomplex string in the complex dictionary, each string segment comprisinga prefix and a simple string. Each segment descriptor defines a contentof a corresponding string segment in the segmented dictionary, and eachbitmask indicates a location of a string segment in the segmenteddictionary within a respective complex string in the complex dictionary.Steps for detecting and locating complex strings in the data streaminclude: performing a simple search to produce detected simple stringsin the data stream, where the simple strings are defined in thesegmented dictionary; selecting candidate string segments from amongspecific string segments containing the detected simple strings; andidentifying candidate complex strings for the at least one complexstring in the complex dictionary, where the candidate complex stringscontain the candidate string segments, using the array of segmentdescriptors and the array of bitmasks.

The method further comprises: (1) associating a state variable with eachcomplex string in the complex dictionary; (2) updating the statevariable according to gauged spans between successive positions in thedata stream, at which positions simple strings belonging to the eachcomplex string terminate; (3) determining, at each position, a subset ofthe candidate string segments belonging to the each complex string; and(4) correlating the state variable with locations, within the eachcomplex string, of candidate string segments of the subset. The step ofcorrelating further comprises formulating a composite current mask as alogical OR function of bitmasks of candidate string segments of thesubset, and performing a logical AND operation of the composite currentmask and the state variable to produce an updated state variable. Thestep of selecting comprises a further step of ascertaining congruence ofa portion of the data stream preceding each detected simple string to aprefix of a corresponding string segment from among the specific stringsegments.

In an exemplary embodiment, the present invention provides an article ofmanufacture comprising at least one processor-readable medium andinstructions carried on the at least one medium. The instructions aredevised to cause a processor to transform the complex dictionary into astructure which enables computationally efficient search. The structurecomprises a segmented dictionary, an array of segment descriptors, andan array of bitmasks. The segmented dictionary comprises string segmentsof each complex string in the complex dictionary, and a suffix. Eachstring segment comprises a prefix and a simple string. Each segmentdescriptor defines content of a corresponding string segment in thesegmented dictionary. Each bitmask indicates a location of a stringsegment in the segmented dictionary said string segment being within arespective complex string in the complex dictionary. The instructionsare further devised to cause the processor to perform simple search toproduce detected simple strings defined in the segmented dictionary,select candidate string segments from among specific string segmentscontaining the detected simple strings, and identify candidate complexstrings in the complex dictionary containing the candidate stringsegments using the array of segment descriptors, and the array ofbitmasks. The instructions further causes the processor to ascertaincongruence of the prefix of each string segment with a correspondingportion of the data stream and congruence of the suffix of each complexstring with a corresponding portion of the data stream. Where the prefixis a NULL prefix, having zero characters, and where the suffix is a NULLsuffix, congruence is inherently ascertained.

In an alternate realization of the article of manufacture, the segmenteddictionary comprises a prefix and string segments of each complex stringin the complex dictionary, with each string segment comprising a simplestring and a suffix. The instructions cause the processor to operate toascertain congruence of the prefix with a respective portion of the datastream and congruence of the suffix of the each string segment with acorresponding portion of the data stream.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention will be further described withreference to the accompanying exemplary drawings, in which:

FIG. 1 illustrates a prior-art system for matching each of a set ofreference strings with potential corresponding strings in a text;

FIG. 2 illustrates an exemplary structure of a complex string for use inembodiments of the present application;

FIG. 3 illustrates exemplary indefinite characters in the complex stringof FIG. 2;

FIG. 4 illustrates alternate forms of segmented complex strings for usein embodiments of the present invention;

FIG. 5 illustrates a mechanism for detecting and locating complexstrings in input data and communicating results to a decision modulewhich determines a course of action, in accordance with an embodiment ofthe present invention;

FIG. 6 illustrates the main steps of a method of detecting complexstrings in accordance with an embodiment of the present invention;

FIG. 7 illustrates a process of segmenting a complex dictionary into adictionary of string segments with two associated segment descriptorsand bitmasks to relate each string segment to its parent complex string,in accordance with an embodiment of the present invention;

FIG. 8 illustrates a mechanism for detecting reference complex stringsin a data stream using the segmented dictionary structure of FIG. 7, themechanism using a simple-search module, and acomplex-string-identification module, in accordance with an embodimentof the present invention;

FIG. 9 illustrates an exemplary method implemented in thecomplex-string-identification module of the mechanism of FIG. 8 inaccordance with an embodiment of the present invention;

FIG. 10 illustrates details of a step of constructing a compositeBoolean MASK in the method of FIG. 9 in accordance with an embodiment ofthe present invention;

FIG. 11 illustrates details of a step of updating a Boolean STATEvariable for determining search progress of a specific complex string inaccordance with an embodiment of the present invention;

FIG. 12 illustrates steps, according to the method of FIG. 9, ofdetecting a target complex string in input data where the complex stringis segmented according to the first segmentation form of FIG. 4 and eachof two consecutive string segments in the input data is compatible withthe first string segment of the target complex string;

FIG. 13 illustrates steps of searching for a target complex string ininput data which contains a complex string of close proximity to thetarget complex string, where the complex string is segmented accordingto the first segmentation form of FIG. 4;

FIG. 14 illustrates steps of detecting a target complex string in inputdata where the complex string is segmented according to the firstsegmentation form of FIG. 4 and two consecutive string segments in theinput data have prefixes of different sizes but each of thecorresponding simple strings is compatible with the first simple stringof the target complex string;

FIG. 15 illustrates steps of detecting a target complex string in thesame input data considered in FIG. 12 but with the complex stringsegmented according to the second segmentation form of FIG. 4;

FIG. 16 illustrates steps of detecting a target complex string in inputdata where the complex string is segmented according to the firstsegmentation form of FIG. 4 and where the target complex string includesmultiple equivalent string segments leading to a composite (comb) MASK,in accordance with an embodiment of the present invention;

FIG. 17 illustrates steps of detecting the target complex stringconsidered in FIG. 16 in input data which includes characters that areincongruent with corresponding prefix characters within the targetcomplex string;

FIG. 18 illustrates a process of creating a composite mask in accordancewith an embodiment of the present invention;

FIGS. 19-21 illustrate steps of detecting any of three target complexstrings of a complex dictionary in a first input-data sample inaccordance with an embodiment of the present invention;

FIGS. 22-23 illustrate steps of detecting any of three target complexstrings of a complex dictionary in a second input-data sample inaccordance with an embodiment of the present invention;

FIG. 24 illustrates the steps of FIG. 19 using an equivalent alternateform of Boolean bitmasks in accordance with an embodiment of the presentinvention;

FIG. 25 illustrates an exemplary complex dictionary comprising complexstrings where a pair of complex strings may contain identical simplestrings for use with an embodiment of the present invention;

FIG. 26 illustrates a segmented dictionary and an associatedsegment-descriptor matrix derived from the complex dictionary of FIG. 25according to an embodiment of the present invention;

FIGS. 27 and 28 illustrate a bitmask-array comprising Boolean bitmaskseach associated with a string segment in the segmented dictionary ofFIG. 26; and

FIG. 29 illustrates a position array each element of which containing apreceding input-data position for a corresponding complex string in thecomplex dictionary of FIG. 26 and a STATE array each element of whichbeing a Boolean variable of multiple bits indicating a search progressfor a corresponding complex string in the complex dictionary of FIG. 25for use in an embodiment of the present invention.

TERMINOLOGY

-   Alphabet: The term alphabet refers to a set of characters which may    include punctuation marks and spaces.-   Class: A subset of characters may be selected to form an alphabet    class. The selected subset of characters may be arranged in an    arbitrary order. For brevity, the term “class” will be consistently    used herein to refer to an alphabet class. Several classes may be    formulated.-   Indefinite character: An indefinite character is an ordinary    character of the alphabet which derives the indefinite status from    its position in a predefined string of characters. An indefinite    character belongs to one of predefined classes and possibly to more    than one class. One of the classes may encompass the entire    alphabet, and a character belonging to such class is treated as a    character with a “don't care” attribute.-   Coherent word: A coherent word comprises a sequence of characters.    It is a character-defined word in which each character is an    ordinary character uniquely defined in the alphabet. If the alphabet    includes punctuation marks and spaces, a group of coherent words may    also be treated as a single coherent word.-   Ambiguous word: An ambiguous word is a class-defined word in which    each character is defined according to class association.-   Simple string: A simple string comprises a coherent word. As    described above, several coherent words separated by spaces may also    constitute a single coherent word.-   Ambiguous string: The term “ambiguous string” is herein used    synonymously with the term “ambiguous word”.-   Complex string: A complex string comprises at least two words, of    which at least one word is an ambiguous word and at least one    ambiguous word is subject to at least one restriction such as a    predefined number of characters or membership of constituent    characters in specific classes.-   Prefix: An ambiguous word preceding a simple string within a complex    string is called a prefix.-   Suffix: An ambiguous word succeeding a simple string within a    complex string is called a suffix.-   String segment: A string segment may comprise a prefix and    immediately following simple string or a simple string and an    immediately following suffix. Either of the two definitions may be    adopted as long as it is used consistently.-   String equality: Two strings are said to be equal, or equivalent, if    they are identical.-   String congruence: Two strings are said to be congruent if they have    the same number of characters and if likewise positioned characters    in the two strings belong to the same class. This applies to a pair    of ambiguous strings or to a pair of complex strings.-   String matching: Two simple strings (coherent strings) are said to    be matching strings if they are equal. Two complex strings are said    to be matching strings if there is one-to-one equality of their    constituent coherent strings and one-to-one congruence of their    constituent ambiguous strings.-   Simple dictionary: A simple dictionary may be devised to include a    set of simple strings of special interest. The simple dictionary may    expand or shrink as the need arises.-   Complex dictionary: A complex dictionary comprises a set of complex    strings. A simple string may be treated as a reduced complex string    and, therefore, the method of the invention will focus on complex    strings. The set of complex strings may be updated to add new    complex strings or delete existing complex strings.-   Text: A text is a sequence of characters extracted from a data    stream and may include ordinary characters and indefinite    characters. A text may be examined to ascertain the existence of any    of complex string from among a predefined set of reference complex    strings forming a complex dictionary.-   Mask: A mask is a sequence of bits, each bit assuming either of the    two states “false” or “true”. When a mask is ANDed with a first    Boolean variable of equal length to produce a second Boolean    variable, each bit of the second Boolean-variable at a position    corresponding to a mask bit of false state (binary 0) is also of    false state. Each bit of the second Boolean-variable at a position    corresponding to a mask bit of true state (binary 1) has the same    state of the corresponding bit of the first Boolean variable.-   Opaque mask: A mask in which each bit represents logical FALSE,    binary 0 for example, is an opaque mask.-   State: The state of an n-bit Boolean state variable is indicated by    bits set to represent logical TRUE (binary 1) and may be denoted    {p₀, p₁, . . . , p_(n)}, where p_(j), 0≤j<n, are positions in the    state variable each having a value of binary 1. For example, a    32-bit Boolean state variable having a value of    [00000000001000010000000000000001] may represented as {0,16,21},    with the rightmost bit being the origin of index 0. A state variable    having a null value, where all its bits are set to binary 0, is    denoted { }.-   String Length: The length of any string is the number of characters    of the string, including indefinite characters.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The method of the present invention, which applies to complex strings,is devised to reduce memory consumption, minimize the computationeffort, reduce computation-time variance, and present detected complexstrings in the order in which they are encountered in an examined datastream.

FIG. 1 illustrates a conventional string-search mechanism 100 where astring locator 120 receives a text 160 and attempts to find portions ofthe text that are listed in a set 140 of reference strings. The output180 of the string locator includes locations in the text of each foundstring. The location information may then be used to produce a varietyof reports depending on the application.

FIG. 2 illustrates a portion of a text including two successiveindependent simple strings “Simple String1” and “Simple String2”,referenced as 210-1 and 210-2 respectively, which are found in the set140 of reference strings. The string locator 120 identifies the twosimple strings independently. The lengths and content of the precedingsubstring 212, the intervening substring 214, and the succeedingsubstring 216 are irrelevant.

FIG. 2 also illustrates a portion of a text which includes an exemplarycomplex string 220 that belongs to some complex dictionary. The complexstring 220 includes three simple strings 230 with the content “One”,“Complex”, and “string”. The content of the simple strings 230, togetherwith the preceding, intervening, and succeeding substrings, collectivelymarked by successive occurrence of a virtual character ‘*’ (a spaceholder), determine whether the complex string 220 is congruent with oneof reference complex strings in some predefined complex dictionary. Theuse of the symbol “*” in any position in complex string 220 should beunderstood to indicate that an indefinite character may occupy theposition. The indefinite character may be any of a predefined subset ofcharacters, such as subsets {A, a, B, b}, {0,1,2,3,4,5}, or {$, ∧, *,+”}, the character * in the latter being an ACTUAL character *. Eachindefinite character in complex strings 222 and 224 belongs to one offive classes defined in FIG. 3. A character belonging to class j, isidentified as 240-j, 0≤j<5.

It is noted that a complex dictionary preferably includes only mutuallydistinct complex strings. However, as will be described below withreference to FIG. 25, the method of the invention is sufficientlyflexible to accept a complex dictionary in which any of the referencecomplex strings may be replicated for whatever reason. It is furthernoted that a complex string may comprise multiple identical simplestrings. A constituent simple string of any complex string may also befound in other complex strings in the same complex dictionary.

In one realization of complex string 220, each character “*” mayindicate a logical “don't care” (a term used extensively in the art).Accordingly, a character “*” may correspond to any recognizablecharacter in a recognized alphabet-list. With 24 such characters in theexemplary complex string 220, and considering a recognizable alphabet of80 unique characters (comprising, for example, the upper-case andlower-case English characters, 10 single decimal digits, and 18auxiliary symbols and punctuation marks), the number of simple stringsthat can be manufactured to be congruent with the exemplary complexstring 220 is the astronomical 80²⁴. Of course, considering grammaticalconstraints in both natural languages and computer-tailored languages,the number of likely encounters in a data stream of complex strings,congruent to the exemplary complex string 220, may be reducedsignificantly. However, the number would still be too large to list thelikely congruent strings in a simple dictionary adapted for use with aconventional simple-search method.

In general, individual indefinite characters “*” in complex string 220may belong to different classes each class being defined by acorresponding subset of the alphabet. Two complex strings 222 and 224,which may be encountered in a data stream contain identical simplestrings in corresponding positions. The two complex strings, however,have different indefinite characters and the congruence, or otherwise,of the two strings is determined according to the class definition ofthe indefinite characters.

FIG. 3 illustrates an exemplary definition of five classes. The fiveclasses are associated with class indicators 0 to 4. Class 0 encompassesall characters of the alphabet. Class 1 includes decimal digits 0 to 9.Class 2 includes upper-case characters A, B, C, and D. Class 3 includesupper-case characters U, V, W, X, and Y. Class 4 includes the symbols(herein also called characters) ∧, #, $, @, and &. Many other classesmay be defined. Based on the class definition of FIG. 3, the complexstrings 222 and 224 of FIG. 2 are determined to be congruent becauseeach decimal digit in complex-string 222 corresponds to a decimal digit(not necessarily equal) in a corresponding position in complex-string224, each symbol of class 4 in complex-string 222 corresponds to asymbol of class 4 at a corresponding position in complex-string 224; andso on.

According to the method of the invention, a complex string is dividedinto string segments. By definition, a complex string contains a numberof simple strings with intervening indefinite characters. The firstconstituent simple string may be preceded by indefinite characters, andthe last constituent simple string may be succeeded by indefinitecharacters. The indefinite strings preceding a simple string isreferenced as a “prefix” and the indefinite strings succeeding a simplestring is referenced as a suffix. A prefix may have an arbitrary number,including zero, of characters. Likewise, a suffix may have an arbitrarynumber, including zero, of characters. A string segment may be definedas a concatenation of a prefix and a succeeding simple string or aconcatenation of a simple string and succeeding suffix.

FIG. 4 illustrates two schemes for segmentation of a complex string tofacilitate further processing. In the first scheme, the complex stringis divided into string segments 420 each comprising a prefix 422 and asimple string 424. A prefix may be a NULL prefix. In the second scheme,the complex string is divided into string segments 430, each comprisinga simple string 424 followed by a suffix 426. A suffix may be a NULLsuffix. According to the first scheme, string segments 420, individuallyidentified as 420-0, 420-1, 420-2, and 420-3 are followed by a suffix426. According to the second scheme, prefix 422 is followed bystring-segments 430, individually identified as 430-0, 430-1, 430-2, and430-3. Either of the two schemes may be used, as long as the same schemeis used consistently.

FIG. 5 illustrates a mechanism 530, in accordance with an embodiment ofthe present invention, for detecting and locating any complex stringbelonging to a basic complex dictionary 520 in received input data 570of a specific data stream. The mechanism 530 comprises a preprocessingmodule 524 for dividing each complex string into string segmentsaccording to either of the two segmentation schemes of FIG. 4. Thesegmented complex strings, together with other associated data arestored in a memory 526. The preprocessing module 524 is activated onlyin response to changes in the basic complex dictionary 520. The changesmay include deletion or addition of reference complex strings.

A string-search module 528 receives input data 570 in data units anduses the segmented complex strings together with their associated datastored in memory 526 to determine the occurrence, or otherwise, of anyof the complex strings of the basic complex dictionary 520 in the inputdata. When the occurrence of a complex string is determined, theposition of the found complex string in the input data 570 is submittedto a decision module 580 which may take some corrective actions such asdeleting the complex string from the input data 570 to produce aprocessed text 590, or simply identifying the detected complex string inthe processed text 590. The string-search module 528 is a time-criticalcomponent of the mechanism 530 and, therefore, optimizing thestring-search process is of paramount importance. However, even if theexecution time is rendered negligibly small, a block of the input data570 need be retained for possible modification if a specific referencecomplex string is found in the input data. The retained data block,which may comprise multiple data packets, a single data packet, or afraction of a packet, is held in a buffer 578. An upper bound of thesize of a held data block, and hence a required storage capacity ofbuffer 578, depends largely on the method of search.

FIG. 6 illustrates an overview of the method of the present invention.Initially, a state variable and a corresponding reference state areassociated with each complex string in the basic complex dictionary 520.In step 620, a simple search detects a simple string in an examined datastream. The detected simple string may be one of a number of simplestrings detected at a specific position in the data stream. The detectedsimple strings may belong to more than one complex string of the basiccomplex dictionary, and more than one detected simple string may belongto one complex string. Detected simple strings belonging to a specificcomplex string may be considered individual or collectively in theprocess of determining whether the specific complex string is present inthe data stream.

Considering one detected simple string at a time, step 630 identifiesall complex strings in the complex dictionary, which contain the simplestring. Step 630 may employ any of well-established simple-searchmethods, such as the Aho-Corasick method. Up to this point, each of theidentified complex strings is treated as a candidate complex string. Instep 640, the state variable associated with each candidate complexstring is updated according to successive positions, in the data stream,at which any simple string belonging to the candidate complex strings isdetected. In step 650, the updated state variable of each candidatecomplex string is compared with a corresponding reference state todetermine the existence, or otherwise, of the candidate complex stringin the data stream. Step 660 examines the results of the comparison foreach candidate complex strings individually. If detection is ascertainedfor an individual candidate complex string, step 670 indicates detectionof the candidate complex string then determines its location in the datastream and reports all relevant information to the decision module 580.The process then proceeds to step 620. If detection of the individualcomplex string is not yet determined, step 660 directs the process tostep 620. Preferable, the execution of step 620 is performed after allcandidate complex strings are examined in step 650.

FIG. 7 illustrates further details of the segmentation process of thebasic complex dictionary 520. The preprocessing module 524 produces asegmented dictionary 750, a set of segment descriptors 752, and abitmask array 754. The segmented dictionary 750 includes eitherstring-segments 420 for each complex string, followed by a suffix 426 ora prefix 422 followed by string-segments 430 (FIG. 4). The segmenteddictionary 750, the set of segment descriptors 752, and the bitmaskarray 754 may be held in separate memory devices or may share a commonmemory device.

A segment descriptor associated with each string segment 420 or 430defines the composition of the string segment. If the first segmentationscheme of FIG. 4 is used, a segment descriptor indicates lengths of theprefix and simple string of a string segment and the length of thesuffix 426. If the second segmentation scheme is used, a segmentdescriptor indicates the length of the prefix 422 and the lengths of asimple string and its suffix.

A bitmask is also associated with each string segment 420 or 430 inorder to bind the string segment to its parent complex string.

FIG. 8 details the string-search module 528 which comprises asimple-search module 820 and a complex-string-identifier module 840. Thesimple-search module 820 receives data units belonging to a data stream812, detects the occurrence of any of the simple strings in thesegmented dictionary 750, and determines the position of each detectedsimple string in the data stream. Any of prior-art methods of simplesearch, such as trie-based search methods, may be used in module 820.Module 820 locates any detected simple string in the input data andcommunicates corresponding indices (pointers) 838 to thecomplex-string-identifier module 840. Such indices serve only asintermediate indices which may be used in locating corresponding indices848 for locating a complex string, if any, in the data stream 812. Thecomplex-string-identifier module 840 relates each simple-string index itreceives from the simple-search module to: (1) a correspondingstring-segment in the segmented dictionary 750; (2) a correspondingsegment descriptor in the set 752 of segment descriptors; and (3) acorresponding bitmask in bitmask array 754. Complex-string-identifiermodule 840 maintains a STATE array each element of which being a BooleanSTATE variable for a corresponding complex string in the basic complexdictionary 520. Each Boolean STATE variable contains a predefined numberof bits; 64 for example. The complex-string identifier comprisessoftware instructions for implementing a search method described belowwith reference to FIGS. 9-11.

In a preferred embodiment of the present invention, an Aho-Corasickautomaton is created and used in the simple-search module 820. TheAho-Corasick method detects simple strings in the order of theiroccurrence in the input data stream. The method also detects alloverlapping simple strings that end at a single position in the datastream. Such overlapping simple strings would have at least one commonend character. For example the two simple-strings chief andeditor-in-chief would be reported if the simple-string editor-in-chiefis encountered in the data stream 812 and if the two simple strings areplaced in separate entries in a corresponding simple dictionary. Themain desirable properties of a real-time string-search method includeefficient memory utilization, predictable computation effort, andorderly listing where strings are detected in the order in which theyoccur in an examined data stream. Notably, the Aho-Corasick method,which is applicable to detection of simple strings, possesses suchproperties and is therefore a preferred method for incorporation in thesimple-search module 820.

FIG. 9 illustrates the main steps of the search method implemented inthe complex-string identifier 840. In step 920, a matching position, p,of at least one simple string belonging to the segmented dictionary 750is received. There may be a set Σ containing several simple stringsending at position p and all belonging to the segmented dictionary 750.The simple strings in set Σ may belong to more than one complex stringof the basic complex dictionary 520. The set Σ is then divided in step922 into subsets of simple strings with each subset including simplestrings belonging to only one complex string in the basic complexdictionary 520. In step 924, one of the subsets, associated with aspecific complex string C is selected. In step 926, an intermediateBoolean variable MASK is created using bitmasks in bitmask array 754corresponding to the subset of simple strings selected in step 924. Thevalue of the Boolean variable MASK is initialized as an opaque maskwhere each bit is set to “false”, which may be represented by logical‘0’, at the start of each step 924. The MASK is then modified under thecondition of congruence of prefixes (or suffixes if the second scheme ofFIG. 4 is used) of the simple strings of the subset and correspondingprefixes (or suffixes) in the specific complex-string C.

In step 928, the intermediate Boolean variable MASK is used to updatethe Boolean variable STATE in a STATE-array memory 860.

In step 930, the index, κ, of the last simple string in the specificcomplex string C, is selected from segment-descriptor set 752, and thebit in Boolean variable STATE in position κ is examined. If the value ofthe bit is “false” (logical “0”), it is determined that the portion ofthe input data terminating in position p does not contain the specificcomplex string C and step 940 is then executed. If the value of the bitis “true” (logical “1”), it is then determined that the portion of theinput data terminating in position p contains all the string segments420 of the complex string C, and the occurrence of the entire complexstring C in the input data is then decided in step 934 according to theω indefinite characters of the suffix of complex string C. If ω=0,indicating a NULL suffix, an occurrence of complex string C isascertained and step 934 reports, to the decision module 580, anoccurrence of the specific complex string C in the portion of the inputdata terminating in position p. If ω>0 and the suffix is incongruentwith corresponding characters spanning positions (p+1) to (p+ω), it isdetermined in step 934 that the input data received so far does notcontained the specific complex string C. Otherwise, step 934 reports, tothe decision module 580, an occurrence of the specific complex string Cin the portion of the input data terminating in position (p+ω) and step940 is executed next.

Step 940 determines if all strings in set Σ have been processed. If theset Σ is not yet exhausted, another subset is processed (step 924).Otherwise, a new simple-string matching position p, as determined instep 920, is considered.

FIG. 10 details step 926 of FIG. 9. In step 1012, a multi-bit Booleanvariable MASK is initialized as an opaque mask, i.e., each bit of theBoolean variable MASK is initialized to logical “0”. The MASK isassociated with a subset σ of simple-strings in Σ belonging to a singlecomplex string. In step 1020, a simple string, denoted S, is selectedfrom the subset σ. The prefix, denoted X, of S in the specific complexstring C is determined in step 1022 and compared with the prefix Y of Sin a corresponding data segment in the segmented dictionary 750. In step1024, if the prefix X and prefix Y are determined to be congruent, step1026 updates the MASK by performing a bit-wise OR of the MASK and thebitmask associated with simple string S in bitmasks memory 754, and step1028 is executed next. The bitwise OR function implemented in step 1026is denoted by the symbol “I”. Thus the operation: MASK|bitmask-of-Scomprises logical OR operations for corresponding bits in the Booleanvariable “MASK” and the Boolean constant “bitmask-of-S”. If the prefix Xand prefix Y are incongruent, step 1024 leads directly to step 1028. Instep 1028, if S is determined to be the last string in the subset a,step 926 is considered complete and the new value of MASK is ready foruse in step 928 of FIG. 9.

FIG. 11 details steps 928 and 934 of FIG. 9. Step 928 updates theBoolean variable STATE associated with complex string C according to theset Σ of simple strings determined to terminate in position p of theinput data. The previous position in the input data at which simplestrings belonging to complex string C were detected is denoted π. Thus,after execution of step 928, the present value of p overwrites the valueof π for use in a subsequent execution of step 928 related to the samecomplex string C. Either of two schemes for identifying currentpositions p and previous positions π may be adopted. In a first scheme,both p and π may take cyclical values based on the length (number ofbits) assigned to a bitmask (and hence to a state variable). In a secondscheme, the values of p and π may be represented according to the wordlength of the computing platform. For example, with a word length offour bytes, p or π may assume a value between 0 and 4,294,967,295. Withthe search process continuing indefinitely, the values of p and π arestill cyclic requiring a modulo process. However, the modulo process isused at a much lower rate.

The span between a current position p and a previous position πassociated with a specific complex string is determined as[p−π]_(modulo Γ), Γ being determined according to either of the twoschemes described above. In step 1120, the Boolean variable STATE isshifted to the left a number of positions equal to the span associatedwith the complex string C. Each position in STATE, from which a bit isshifted, is assigned a value of “0”, except the right-most positionwhich is always assigned a value of “1” after a shift operation. In step1122, a bit-wise logical ANDing is performed and the result overwritesthe variable STATE.

As described, the bitmask used in step 1122 is considered to originateat the rightmost bit and, consequently, the Boolean state variable isshifted a number of bits equal to (p−π)_(modulo Γ), where Γ equals2^(W), W being the word length assigned to the position indices p and π,in the direction from right to left with the rightmost bit of theBoolean variable set to equal TRUE (binary 1). Alternatively, thebitmask may originate at the leftmost bit and, consequently, the Booleanstate variable may be shifted in the direction from left to right withthe leftmost bit of the Boolean variable set to equal TRUE asillustrated in FIG. 24.

In an alternate realization of the mechanism illustrated in FIGS. 7-9,the complex string may be segmented according to the second segmentationform of FIG. 4 and the segmented dictionary may comprise a prefix and anumber of string segments for each complex string in the complexdictionary, with each string segment comprising a simple string andsuffix. Step 1022 would then be replaced with a step of determining asuffix of simple string S. Step 934 which determines congruence of asuffix of a complex string and a respective portion of input data wouldbe replaced with a step of determining congruence of a prefix of thecomplex string and a respective portion of input data. FIG. 15illustrates steps of detecting a target complex string based on usingthe second segmentation form of FIG. 4.

FIG. 11 also details step 934. Having determined, in step 932, that thebit in position κ of the Boolean STATE variable equals a binary 1, itremains to ascertain the congruence of the suffix, if any, and acorresponding portion of the input data. In step 1152, a length ω of thesuffix of complex string C is read from the set of segment descriptors752. If ω is found to be zero, step 1154 directs the search process tostep 1160 to report matching of the complex string C at position p. Ifω>0, step 1156 determines whether the ω indefinite characters of thesuffix are congruent to input data characters spanning positions (p+1)to (p+ω). If congruence is ascertained, step 1158 directs the searchprocess to step 1160 to report success in detecting complex string C ina portion of the input data ending at position (p+ω). If the congruenceconditions are not met, step 1158 directs the search process to step 940to either complete the examination of a current set Σ or consider a newmatching position p.

Exemplary Execution of the Method

FIG. 12 illustrates steps of detecting an exemplary target complexstring 1220 in input data 1250 of a data stream. The complex string 1220is segmented according to the first segmentation form of FIG. 4. Thecomplex string 1220 comprises three simple strings “DE”, “KL”, and“MPQST” having prefixes of length 4, 4, and 5, respectively. With thelast simple string having a suffix of length 2, the total length of thecomplex string 1220 is 24 characters. The prefixes and the suffixcomprise indefinite characters, each indefinite character being markedas “*”. The input data comprises two consecutive strings “DE” which arecompatible with the first simple string the target complex string 1220.

A ruler 1202 is used to indicate a position of each character of theinput data 1250 and each character of the complex string 1220. The inputdata extracted from a data stream may continue ad infinitum and,therefore, a position in the input data is indexed as a cyclic number.The ruler 1202 is a cyclic ruler having a range dictated by a number offactors including the hardware platform on which the method is realizedinto an article of manufacture.

In general, the simple search module 820 may detect several simplestrings ending in one position of the input data. FIG. 12, however,illustrates a case where the simple-search module 820 detects only onesimple string at each of current detection positions 06, 12, 18, and 28.A case with multiple simple-string detection is illustrated in FIG. 19.The gap δ between successive detection positions p is indicated in FIG.12. Notably, the preceding detection position to current detection pointp=06 is either 0 when the search mechanism is initialized, or known froma previous detection of a simple string belonging to the same exemplarycomplex string 1220.

As described earlier, the preprocessing module 524 produces an array ofbitmasks 754, each bitmask indicating the relative positions of eachsimple string within its parent complex string. Three bitmasks 1240,individually identified as 1240-0, 1240-1, and 1240-2, respectivelyindicate the relative positions of simple strings “DE”, “KL”, and“MPQST” in complex string 1220. A Boolean state variable 1260 having 32bits is associated with complex string 1220. A current MASK is createdin step 926 which is further detailed in FIG. 9. A bit in a bitmask 1240set to logical FALSE (binary 0) is represented by a blank cell 1241, anda bit set to logical True (binary 1) is represented by a hatched cell1242. Likewise a bit in state-variable 1260 set to logical FALSE isrepresented by a blank cell 1261 and a bit set to logical TRUE(binary 1) is represented by a hatched cell 1262. A similarrepresentation is used in FIGS. 13-24.

The current MASK is an outcome of bitwise OR operations of bitmasks ofall simple strings detected at a given position in the input data 1250subject to congruence of a prefix of each of simple strings to acorresponding portion of the input data as indicated in step 1022.Notably, the state variable 1260 is initialized in step 1012 as anopaque mask in the process of creating a current mask detailed in FIG.10. In the example of FIG. 12, it is assumed that the congruencecondition is always satisfied and, because there is only one simplestring detected at each of the four positions indicated, the currentmask at each of the four detected positions (p=06, 12, 18, and 28) isequal to the bitmask in bitmask array 754 of the corresponding detectedsimple string.

As indicated in step 1120, the state variable 1260 is shifted (p−π) bits(modulo Λ) and the rightmost bit of the shifted state variable is set toequal logical TRUE, which is equated to binary 1. With π=0 at positionp=06, and starting with an opaque state { }, the state variable isshifted 6 bits to the left with the bit in position 0 set to equalbinary 1 to attain a state of {0}. The shifted state variable is bitwiseANDed with bitmask 1240-0 corresponding to simple string “DE”. Theresult is a state of {0}, i.e., the rightmost bit of the state variableis set to binary 1 and each other bit is set to binary 0. There are twostates corresponding to each detected simple string in the input data1250; a first state resulting from executing step 1120 and a secondstate resulting from executing step 1122 of FIG. 11. At position p=12,the state variable is shifted (12-6) bits with the rightmost bit set totrue to yield a state of {0,6}. The state variable 1260 is ANDed withbitmask 1240-0 corresponding to simple string “DE” and the result is astate {0}. At position p=18, the state variable is shifted (18-12) bitsand the rightmost bit is set to binary 1 leading to state {0,6} again.The state variable 1260 is ANDed with bitmask 1240-1 corresponding tosimple string “KL” to yield a state of {6}. At p=28, the state variable1260 is shifted (28-18) bits with the rightmost bit set to binary 1leading to state {0,16}. The state variable 1260 is then ANDed withbitmask 1240-2 corresponding to simple string “MPQST” to yield a stateof {16}, which is the reference state of complex string 1220. It remainsto determine if the suffix of the complex string 1220 is congruent tothe two characters succeeding the last simple string “MPQST”. Step 1152of FIG. 11 determines that the suffix of complex string 1220 is oflength 2 characters and step 1156 ascertains congruence of the suffix(occupying positions 22 and 23 of complex string 1220) is congruent withthe portion of the input data 1250 occupying positions 29 and 30, andstep 1160 reports the presence of complex string 1220 in the input data1250 starting at position 9 and ending in position 30. The bitmasks 1240and the state variable 1260 are indexed in an ascending order from rightto left, with the rightmost bit of each assigned an index of zero. Areverse ruler 1204 is therefore provided in FIG. 12 and in subsequentfigures.

FIG. 13 illustrates a search for the same target complex string 1220 ofFIG. 12 in input data 1350, which differ slightly from input data 1250,following the steps described above. The bitmasks 1240 in FIGS. 12 and13 are identical. Like state variable 1260, state variable 1360 attainsthe states {0}, (0), {0,6}, 0}, {0,6} after processing the second simplestring “DE”. However, because the simple string “KL” appearsone-character earlier in input data 1350 in comparison with input data1250, the last state {0,6} is followed by state {6} (instead ofcorresponding {0,6} of FIG. 12), leading to a subsequent opaque state {} after processing the simple string “KL” (compared to correspondingstate {6} in FIG. 12). The subsequent states attained when position p=28is encountered are {0,11} which yields the opaque state { } when ANDedwith bitmask 1240-2. At this point, step 932 of FIG. 9 directs theprocess to step 940 to start the search for a simple string, in theinput data, that belongs to the complex string 1220.

FIG. 14 illustrates a search for the same target complex string 1220 ofFIG. 12 in input data 1450 which differs slightly from input data 1250.The simple strings “DE”, “DE”, “KL”, and “MPQST” in input data 1450occupy positions p=6, 13, 19, and 29 compared to 6, 12, 18, and 28 ininput data 1250. The first detected simple string “DE” is irrelevant inthe examples of FIGS. 12 and 14. The effect of the one-character shiftis that the state variable 1460 acquires states {0}, {0}, {0,7}, {0},etc., instead of states {0}, {0}, {0,6}, {0}, etc. of state variable1260, and the complex string 1220 is determined to occupy positions 10to 31 of the current cycle of input data 1450.

FIG. 15 illustrates the detection of complex string 1220 in input data1250 using similar steps to those of FIG. 12 except that the complexstring 1220 is segmented according to the second segmentation form ofFIG. 4. The bitmasks 1540-0, 1540-1, and 1540-2 for simple strings “DE”,“KL”, and “MPQST”, respectively, of the complex string 1220 are simplebitmasks each having a single bit set to binary 1 as illustrated byhatched cells 1542 in FIG. 15. A blank cell 1541 represents binary 0.Simple strings “DE”, “DE”, “KL”, and “MPQST” are detected at positionsq=5, 11, 17, and 24. Starting with an opaque state { }, the statevariable 1560 assumes states {0}, {0}, at position q=5, {0,6}, {0}, atposition q=11, {0,6}, {6}, at position q=17, and {0,13}, {13}, at q=24.The last state {13} is in agreement with the bitmask 1540-2 of the lastsimple string “MPQST” of complex string 1220. If congruence of theprefix of the first string “DE” in complex string 1220 withcorresponding characters occupying positions 7, 8, 9, and 10 in inputdata 1250 is ascertained, the portion of input data 1250 occupyingpositions 7 to 30 is considered to include the entire complex string1220.

FIG. 16 illustrates steps of detecting a target complex string 1620 ininput data 1650 where the complex string 1620 includes multiplecongruent string segments each including a prefix of two characters andthe simple string “DE”. As described earlier, the purpose of a bitmaskassociate with a simple string is to relate the simple string to itsparent complex string. When a simple string “DE” is detected in inputdata 1650, means for considering all occurrences of “DE” in the complexstring 1620 need be provided. In accordance with the method of thepresent invention, a composite (comb) bitmask 1680-0 is devised in step926 of FIG. 9 (further detailed in FIG. 10). Subject to congruenceconditions of step 1022, the composite bitmask 1680-0 includes a bit setto binary 1 (logical TRUE) at positions 0, 4, and 8 where binary 1 atposition 0 corresponds to the position of the end character of the firstoccurrence of “DE”, and the binary 1 in positions 4 and 8 correspond tothe end characters of the second and third occurrences of “DE” in thecomplex string. Bitmasks 1640-1 and 1640-2, for simple strings “KL” and“MPQST” respectively, are simple bit masks; each includes only one bitset to binary 1. The process of determining the presence, or otherwise,of complex string 1620 in input data 1650 proceeds as described in FIGS.9 to 11, and as further illustrated in the example of FIG. 12. It isnoted that the input data includes an additional simple string “DE”which is detected by the simple-search module 820 and automaticallyfiltered out. For each position p where at least one simple string isdetected in the input data 1650, the state variable 1660 is updated instep 1120 then in step 1122 illustrated in FIG. 11. Starting with theopaque state { }, the state variable 1660 successively attains thestates {0), {0}, {0,4}, {0,4}, {0,4,8}, {0,4,8}, {0,4,8,12}, {0,4,8},{0,6,10,14}, {14}, {0,22}, and {22} corresponding to positionsp=4,8,12,16,22, and 30, respectively. It is noted that there are twostates corresponding to each detected simple string in the input data1650; a first state resulting from step 1120 and a second stateresulting from step 1122. Successful detection is ascertained when thelast state of state variable 1660 attains the value of {22} which is thereference state for the complex string 1620.

FIG. 17 illustrates the case of FIG. 16 but with characters precedingsimple string “KL” in input data 1750 associated with classes that aredifferent from classes of their counterpart characters in the prefix ofsimple string “KL” in the target complex string 1620. This results instep 926 (FIGS. 9 and 10) yielding an opaque mask for p=22 which whenANDed with the current value of the Boolean state variable 1760 yieldsan opaque state variable, which in effect erases the state informationacquired so far. The subsequent state of the state variable 1760 atposition p=30 is then {0, 8} which does not include the target state{22}. The deviation of the state 1760 from its counterpart state 1660 isindicated in FIG. 17 by the mark “x” in state variable 1760corresponding to p=22.

FIG. 18 illustrates the execution of step 926 of the method of FIG. 9,which is further detailed in FIG. 10. The target complex string 1820includes simple strings “ABCD”, “CD”, “D”, “CD”, and “BCD”. At position7 of input data 1850, the simple search module 820 detects the fivesimple strings 1825 in proper order as indicated. The bitmasks (1840)for the five simple strings 1825 yield a composite mask 1880A if all thecongruence conditions of step 1022 are met. A composite mask 1880Bresults if the indefinite character ‘f’ preceding the simple string “CD”ending in position 19 of the input data is incongruent with the prefixcharacter of position 14 of the target complex string 1820.

FIG. 19 illustrates a set of reference complex strings 1920-0, 1920-1,and 1920-2 and input data 1950 of a data stream comprising simplestrings belonging to the set of reference complex strings 1920. Thefirst reference complex string 1920-0 contains simple strings “UVWXY”,and “ABCD”. The second reference complex string 1920-1 contains simplestrings “ABCD”, “CD”, and “CD. The third reference complex string 1920-2contains simple strings “DC”, “CD”, and “CD”. Each indefinite characterin the reference complex strings is identified by a symbol “*”.Individually, the indefinite characters may belong to different classesdespite the common identification “*”. The segmented dictionary 750includes eight simple strings “UVWXY”, “ABCD”, “BCD”, “CD”, “CD”, “DC”,“CD”, and “CD”. The simple-search module 820 examines the input data todetect simple strings belonging to the segmented dictionary 750.

At position 7 (according to ruler 1202) of the input data 1950, thesimple-search module 820 detects a set Σ⁽⁰⁾ of six simple strings“ABCD”, “BCD”, “CD”, “CD”, “CD”, “CD”, out of the eight simple stringsof the segmented dictionary 750, and associates each of the detectedsimple strings with a parent complex string. A subset σ₀ of Σ⁽⁰⁾,referenced as 1925-0, contains detected simple strings (only one in thisexample) belonging to complex string 1920-0. A subset σ₁ of Σ⁽⁰⁾,referenced as 1925-1, contains detected simple strings (three in thisexample) belonging to complex-string 1920-1. A subset σ₂ of Σ⁽⁰⁾,referenced as 1925-2, contains detected simple strings (two in thisexample) belonging to complex-string 1920-2. The simple string “CD”further appears separately in two portions of input data 1950 to bedetected later by the simple-search module 820. Each of the simplestrings in set Σ⁽⁰⁾ belongs to at least one string segment in at leastone complex string in the set of reference complex strings 1920. Stringsegments in the set of reference complex strings 1920 are candidatestring segments. Their presence in the input data 1950 may beascertained only after satisfying congruence conditions as describedearlier with reference to FIG. 10 (step 1022). The set of referencecomplex strings 1920 represents a basic complex dictionary 520containing only three complex strings. In general, a basic complexdictionary 520 may comprise a significantly larger number of complexstrings, and detected simple strings such as those of subset σ₁ of Σ⁽⁰⁾may belong to many candidate string segments in segmented dictionary 750(FIG. 7) which, in turn, may belong to many candidate complex strings inthe basic complex dictionary. Each candidate string segment isconsidered for further processing only after ascertaining congruence ofits indefinite characters and corresponding characters of the inputdata.

Assuming congruence of all the indefinite characters in the referencecomplex strings 1920 to corresponding characters of input data 1950,based on the prefix and suffix definitions, the current maskscorresponding to subsets σ₀, σ₁, σ₂ of Σ⁽⁰⁾ are determined according tothe bitwise OR operation of step 1026. Thus, the bitmask for subset σ₀of Σ⁽⁰⁾ has only one bit in position 9 set to binary 1. The position ofthe set bit corresponds to the displacement (19-10) of the end character“D” of the detected simple string “ABCD” from the end character “Y” ofthe first simple string “UVWXY” of complex-string 1920-0. The bitmaskfor subset σ₁ of Σ⁽⁰⁾ has three bits in positions 0,4, and 12 set tobinary 1, the positions being determined by the displacement of each ofthe simple strings in σ₁ from the end character “D” of the first simplestring “BCD” in complex string 1920-1. The bitmask for subset σ₂ of Σ⁽⁰⁾has two bits in positions 10 and 17 set to binary 1, the positions beingdetermined by the displacement of each of the simple strings in σ₂ fromthe end character “C” of the first simple string “DC” in complex string1920-2.

As illustrated in FIG. 20, the simple-search module 820 detects a setΣ⁽¹⁾ of three simple strings “CD”, “CD”, and “CD” at position 11(according to ruler 1202) of the input data 1950 with a subset 2025-1having one simple string belonging to complex-string 1920-1, and asubset 2025-2 having two simple strings belonging to complex string1920-2. With congruent conditions for all suffix and prefixes of eachcomplex string 1920 satisfied, the composite current mask 2080-1 forsubset 2025-1 has bits set to binary 1 in positions 4 and 12, determinedas the displacements (8-4) and (16-4). The composite current mask 2080-2for subset 2025-2 is the same as composite current mask 1980-2.

At position 19 (according to ruler 1202) of the input data 1950, thesimple-search module 820 detects a set Σ⁽²⁾ identical to Σ⁽⁰⁾ and thesame composite current masks 2080-1 and 2080-2 also apply.

FIG. 21 illustrates the outcome of step 928 which updates the states ofstate variable 2160 associated with complex string 1920-1(“**BCD**CD******CD******”). Complex-string 1920-1 is the only one ofcomplex strings 1920 that is present in the input data 1950. Startingfrom the null state { }, and following the state transitions effected bystep 928 (FIG. 9 and FIG. 11), the successive states of state variable2160 are {0}, {0}, {0, 4}, {4}, {0, 12}, and {12}, which are identifiedin FIG. 21 with references 2160 a 0, 2160 b 0, 2160 a 2, 2160 b 2.States 2160 aj and 2160 bj, where j=0, 1, or 2, result from execution ofsteps 1120 and 1122, respectively, of FIG. 11. The last state {12}equals the reference state of complex-string 1980-1 which is determinedas the displacement of the last character of the last simple string “CD”from the last character of the first simple string “BCD”.

FIGS. 22-23 illustrate a case where the reference complex strings arethe same as those of FIG. 19, but the input data 2250 differs only inposition 5 (according to the same ruler 1202) where character “B” isreplaced with “Q”. This results in the absence of simple strings “ABCD”and “BCD” from the set Σ⁽⁰⁾ and, consequently, a transition from state {}, of state variable 2360 associated with reference complex string1920-1, to states {0}, then the opaque state { } to indicate absencefrom the input data 2250 of the first simple string “BCD” of complexstring 1920-1, with a final opaque state { }. Thus, starting from thenull state { }, and following the state transitions effected by step 928(FIG. 9 and FIG. 11), the successive states of state variable 2360 are{0}, { }, {0}, { }, {0}, and { }, which are identified in FIG. 23 withreferences 2360 a 0, 2360 b 0, 2360 a 2, 2360 b 2. States 2360 aj and2360 bj, where j=0, 1, or 2, result from execution of steps 1120 and1122, respectively, of FIG. 11.

FIG. 24 illustrates the detection process of FIG. 22 with the bitmasksand Boolean state variables each having the leftmost bit, instead of therightmost bit, as the origin with index 0. The set of composite currentmasks 2480-0, 2480-1, and 2480-2 of FIG. 24 is a mirror image of the setof composite current masks 2180-0, 2180-1, and 2180-2 of FIG. 21. TheBoolean state variable 2460 of FIG. 24 is a mirror image of the Booleanstate variable 2160 of FIG. 21.

FIG. 25 illustrates an exemplary basic complex dictionary 520 (FIG. 5)comprising 16 complex strings 2510-0, 2510-1, . . . , 2510-15, eachhaving simple strings 2520. Successive simple strings 2520 are separatedby ambiguous words. Each of complex strings 2510-6 and 2510-11 has aprefix 2522 and each of the remaining complex strings 2510 has a nullprefix. Each of complex strings 2510-4, 2510-5, 2510-6, 2510-8, and2510-11 has a null suffix and each of the remaining complex strings 2510has a suffix 2524.

The 16 complex strings 2510 are distinct. However, the method describedwith reference to FIGS. 9-11 tolerates repeated complex strings 2510 inthe complex dictionary 520. Several constituent simple strings 2520 arecommon in more than one complex string 2510. For example, thesimple-string “Wilkinson” is common in complex strings 2520-1, 2520-4,2520-5, 2520-6, 2520-14, and 2520-15.

FIG. 26 illustrates the process of segmenting complex dictionary 520into a segmented dictionary 2650 and a segment-descriptor matrix 2652.Each entry in the segmented dictionary 2650 includes a string segmentcomprising a prefix 2622 (which can be a null prefix) and one simplestring 2620. A last string segment of each complex string has anappended suffix 2624, which can be a null suffix. Each row insegment-descriptor matrix 2652 includes a field 2612 indicating a lengthof a prefix (which may be zero) and a field 2614 indicating a length ofthe corresponding string segment (which includes the length of thesimple string of the string segment plus the length of its prefix). Arow in segment-descriptor matrix 2652 corresponding to a last segment ofa complex string further includes a field 2616 indicating a length of asuffix (which may be zero) and a field 2618 indicating a sum of lengthsof string segments, excluding the first string segment, of acorresponding complex string. The content of field 2618 defines acorresponding bitmask.

FIGS. 27-28 illustrate a bitmask array 2754, comprising bitmasks 2740for relating each string segment to its parent complex string. Thebitmasks are of equal length. Examples of bitmasks 2740 are presented inFIGS. 12-16 where they are referenced as 1240 in FIGS. 12-14, 1540 inFIGS. 15, and 1640 in FIG. 16. FIGS. 27-28 illustrate bitmasks in theirinitial state, each being initialized as an opaque mask represented as asequence of binary “0”. To facilitate observation of state change, thebitmasks and the Boolean state variables in FIGS. 12-24 are illustratedas sequences of blank and hatched cells instead of sequences of binary“0” and “1”.

Each bitmask corresponds to a string segment in the segmented dictionary2650 and has a bit in a position corresponding to the end character ofthe string segment set to “true” (binary 1). The position is relative tothe end character of the first simple string of the complex string.

FIG. 29 illustrates a state-array 2940 having one Boolean state variable2950 per complex string in the basic complex dictionary 520. The Booleanstate variables 2950 are individually identified as 2950-0 to 2950-15,where the reference numeral 2950-j corresponds to a complex string2510-j of the complex dictionary 520. A position array 2920 has an entry2930-j indicating a last position of the input data at which a simplestring belonging to complex string 2510-j was detected. The positionarray 2920 and the state array 2940 are used in the algorithm depictedin FIGS. 9-11.

The invention thus provides a computationally efficient method forscreening a data stream to detect and locate complex strings belongingto a basic complex dictionary. The basic complex dictionary may comprisea very large number of complex strings, each including coherent stringsand ambiguous strings. The method is partly based on establishingequality of coherent strings and congruence of ambiguous strings, wherecongruence of any two characters is based on their joint membership toone of predefined character classes.

The method is well adapted to software realization in a single-processoror multi-processor computing environments. The segmentation process ofthe basic complex dictionary into a segmented dictionary and associatedsegment descriptor and bitmasks, as illustrated in FIG. 7, is performedonly when complex strings are added to, or deleted from, the basiccomplex dictionary. The process may, therefore, be implemented in acomputing facility other than the computing facility used for executingthe real-time processes of the string-search module 528 of FIG. 5, whichis further detailed in FIG. 8.

Furthermore, in a multi-processor environment, the processes implementedby the two basic components 820 and 840 of the string-search module 528,may be pipelined to increase the rate at which complex strings can bedetected and, hence, enable handling data streams of high flow rates.

Although specific embodiments of the invention have been described indetail, it should be understood that the described embodiments areintended to be illustrative and not restrictive. Various changes andmodifications of the embodiments shown in the drawings and described inthe specification may be made within the scope of the following claimswithout departing from the scope of the invention in its broader aspect.

What is claimed is:
 1. An apparatus for detecting presence of a targetcomplex string in a data stream, said apparatus comprising: a firstprocessor executing instructions to locate coherent strings of saidtarget complex string in said data stream, said target complex stringcomprising a number of ambiguous strings interleaved by coherentstrings, each character in said coherent strings being uniquely definedin an alphabet, each character in said ambiguous strings belonging toone of predefined classes of characters; and a memory device storingprocessor executable instructions which cause a second processor to:access a table of said predefined classes of characters, each classcorresponding to a respective subset of characters, to ascertainequality of classes of likewise positioned characters of portions ofsaid data stream which interleave said coherent strings and respectiveambiguous strings of said target complex string; and perform correctiveactions subject to locating said coherent strings and ascertaining saidequality of classes.
 2. The apparatus of claim 1 wherein said firstprocessor and said second processor are pipelined.
 3. The apparatus ofclaim 1 further comprising a storage medium maintaining: a predefinedcomplex dictionary containing a plurality of complex strings, eachcomplex string having an arbitrary number of interleaving coherentstrings and ambiguous strings; processor executable instructions whichcause a pre-processor to segment said predefined complex dictionary intoa segmented dictionary and a set of segment-descriptors, so that: eachentry in said segmented dictionary comprises a string segment of arespective complex string; and each segment descriptor comprises numericdata for facilitating parsing said respective complex string.
 4. Theapparatus of claim 3 wherein said pre-processor is configured to updatesaid segmented dictionary and said set of segment-descriptors inresponse to one of: addition of a new complex string to said complexdictionary; and deletion of an existing complex string from said complexdictionary.
 5. The apparatus of claim 1 further comprising a memorydevice storing processor executable instructions which cause said firstprocessor to locate said coherent strings according to one of: anAho-Corasic automaton; and a generic trie-search automaton.
 6. Theapparatus of claim 1 wherein said corrective actions comprise modifyingsaid data stream.
 7. The apparatus of claim 1 wherein said correctiveactions comprise deleting said specific complex string from said datastream.
 8. The apparatus of claim 1 further comprising a buffer forretaining a block of input data of said data stream until said detectingis complete.
 9. The apparatus of claim 3 wherein said string segment ofsaid respective complex string comprises an ambiguous prefix followed bya coherent string, with a last string segment of said respective complexstring followed by an ambiguous suffix.
 10. The apparatus of claim 9wherein: said numeric data comprises a first field indicating a lengthof said ambiguous prefix and a second field indicating a length of saidstring segment; and said numeric data corresponding to a last stringsegment of said respective complex string comprises a third fieldindicating a length of an ambiguous suffix following said last stringsegment.
 11. A method for detecting presence of a target complex stringsin a data stream, the method comprising configuring at least oneprocessor to execute processes of: locating coherent strings of saidtarget complex string in said data stream, said target complex stringcomprising a number of ambiguous strings interleaved by coherentstrings, each character in said coherent strings being uniquely definedin an alphabet, each character in said ambiguous strings belonging toone of predefined classes of characters; and accessing a table of saidpredefined classes of characters, each class corresponding to arespective subset of characters of an alphabet, to ascertain equality ofclasses of likewise positioned characters of portions of said datastream which interleave said coherent strings and respective ambiguousstrings of said target complex string; and performing corrective actionssubject to said locating coherent strings and ascertaining said equalityof classes.
 12. The method of claim 11 wherein the processes of locatingand ascertaining are pipelined.
 13. The method of claim 11 furthercomprising: storing, in a memory device, a predefined complex dictionarycontaining a plurality of complex strings, each complex string having anarbitrary number of interleaving coherent strings and ambiguous strings;configuring a pre-processor to segment said predefined complexdictionary into a segmented dictionary and a set of segment-descriptors,so that: each entry in said segmented dictionary comprises a stringsegment of a respective complex string; and each segment-descriptorcomprises numeric data for facilitating parsing said respective complexstring.
 14. The method of claim 13 further comprising updating saidsegmented dictionary and said set of segment-descriptors in response toone of: addition of a new complex string to said complex dictionary; anddeletion of an existing complex string from said complex dictionary. 15.The method of claim 11 wherein said locating comprises implementing atleast one of: an Aho-Corasic automaton; and a generic trie-searchautomaton.
 16. The method of claim 11 wherein said corrective actionscomprise modifying said data stream.
 17. The method of claim 11 whereinsaid corrective actions comprise deleting said specific complex stringfrom said data stream.
 18. The method of claim 11 further comprisingretaining a block of input data of said data stream until said detectingis complete.
 19. The method of claim 13 further comprising dividing saideach complex string into string segments, each string segment comprisingan ambiguous prefix followed by a coherent string, with a last stringsegment of said each complex string followed by an ambiguous suffix. 20.The method of claim 19 further comprising entering in said set ofsegment-descriptors indications of a length of said ambiguous prefix, alength of said string segment, and a length of said ambiguous suffix.